perm filename TR324.4[AM,DBL] blob
sn#574946 filedate 1981-03-24 generic text, type T, neo UTF8
<CSD.LENAT>TRACE.MAR24.4 is now open.
"24-Mar-81 12:50:17"
*
P
(IsA (Heuristic Op) English (IF the current task is to specialize a unit, and a
slot has been chosen to be the one --) IfPotentiallyRelevant NULL Worth 700
Abbrev (Specialize a given slot of a given unit) IfWorkingOnTask (LAMBDA & &)
ThenPrintToUser (LAMBDA & & & & & T) ThenCompute (LAMBDA & & & & & & & & & & & &
&) ThenDefineNewConcepts (LAMBDA & & & & & & & & & & & T) Applics (& & & & & &
& & & & & & & & & & & & & --))
*12 PP
[LAMBDA (task)
(AND (IsAKindOf CurSlot (QUOTE Specializations))
(SETQ SlotToChange (CADR (ASSOC (QUOTE SlotToChange)
CurSup]
*E SlotToChange
IfTrulyRelevant
*E CurUnit
H1
*E CurSlot
Specializations
*NX NX PP
[LAMBDA (task)
(CPRIN1 13 CRLF "Specialized the " SlotToChange " slot of " CurUnit
", replacing its old value ")
(CPRIN1 48 "(which was " OldValue ") ")
(CPRIN1 14 "by " NewValue "." CRLF)
(CPRIN1 13 CRLF)
T]
*NX NX PP
[LAMBDA (task) **COMMENT**
(SETQ UDiff NIL)
(SETQ AreUnits NIL)
(SETQ HaveSpec NIL)
[SETQ NewValue (APPLY* (PACK* (QUOTE Specialize)
(DataType SlotToChange))
(SETQ OldValue (APPLY* SlotToChange CurUnit]
(SETQ NeedSpec (SetDiff AreUnits HaveSpec)) **COMMENT**
(MAPC HaveSpec (QUOTE TinyReward))
[AND HaveSpec
(SETQ TaskResults
(AddPropL TaskResults (QUOTE RewardedUnits)
(CONS HaveSpec
(APPEND (QUOTE (because they could have been used in
specializing))
(LIST CurUnit]
(SETQ Agenda
(MergeTasks [MAPCAR NeedSpec
(FUNCTION (LAMBDA (ns)
(LIST (Half CurPri)
ns
(QUOTE Specializations)
[LIST (CONS CurUnit
(APPEND (QUOTE (might have been
specialized
better,
earlier, if
some
specializations had
existed for)
)
(LIST ns]
(LIST (LIST (QUOTE CreditTo)
(QUOTE H6]
Agenda))
[AND NeedSpec
(SETQ TaskResults
(AddPropL TaskResults (QUOTE NewTasks)
(CONS NeedSpec
(APPEND (QUOTE (will be specialized, because if such
specializations had existed, we
could have used them just now
while trying to specialize))
(LIST CurUnit]
(COND
((EQUAL OldValue NewValue)
(CPRIN1 15 CRLF
"Hmmm... couldn't seem to find any meaningful specialization of the "
SlotToChange " slot of " CurUnit CRLF)
NIL)
((IGREATERP Verbosity 15)
(CPRIN1 15 CRLF "Inside the " SlotToChange " slot, ")
(MAPRINT UDiff)
(TERPRI)
T)
(T T]
*NX P
ThenDefineNewConcepts
*NX P
(LAMBDA (task) (SETQ NewUnit &) (MAPC & &) (PUT NewUnit SlotToChange NewValue) (
SETQ NewUnits &) (COND & &) (ADDPROP & & &) (MAPC & &) (PUT NewUnit & &) (
ADDPROP CurUnit & NewUnit) (ADDPROP NewUnit & CurUnit) T)
*E NewUnit
H1
*3 PP
(SETQ NewUnit (CreateUnit CurUnit CurUnit))
*↑
*F Specializations
*NX P
NX ?
*P
... Specializations)
*REDO F
*P
... Specializations)
*REDO F
*P
... Specializations)
*REDO F
*OK
(FinishedEditing H6)
:Specializations(H6)
NIL
:
EDITF(CreateUnit)
edit
*
PP
[LAMBDA (N NOLD) **COMMENT**
(COND
((NOT (ATOM N))
(WARNING (CONS "Must be atomic unit name! You typed: " N)))
((MEMB N Units)
(CreateUnit (NewNam N)
NOLD))
((MEMB NOLD Units)
(SETQ Units (CONS N Units))
(SETQ NewU (CONS N NewU))
[SETPROPLIST N (MergeProps (APPEND (GETPROPLIST N))
(SlotSubst N NOLD (GETPROPLIST NOLD]
[MAPC (PROPNAMES N)
(FUNCTION (LAMBDA (P)
(COND
((DontCopy P)
(REMPROP N P))
((DoubleCheck P)
(CheckTheValues N P (APPLY* P N]
(AddInv N)
N)
(T (SETQ Units (CONS N Units))
(PUT N (QUOTE Worth)
500)
N))
(DefineIfSlot N]
*OK
CreateUnit
:Units
(H1-18 H1-17 H1-16 H1-15 H1-14 Conjec-31 Conjec-30 Conjec-29 Conjec-28 Conjec-27
Conjec-26 Conjec-25 Conjec-24 Conjec-23 Conjec-22 Conjec-21 Conjec-20 Conjec-19
Conjec-18 H15 H4-5 H4-4 H4-3 H4-2 H4-1 Conjec-17 H3-6 H3-5 H3-4 H3-3 H3-2 H3-1
Conjec-16 EQ-4 EQ-3 EQ-2 EQ-1 H5-4 H5-3 H5-2 H5-1 Conjec-15 Conjec-14 Conjec-13
Conjec-12 Conjec-11 Conjec-10 Conjec-9 Conjec-8 Conjec-7 Conjec-6 Conjec-5
Conjec-4 Conjec-3 Conjec-2 H1-13 H1-12 H1-11 H1-10 H1-9 Worth-2 Worth-1 Abbrev-1
English-1 H1-8 H1-7 H1-6 H1-5 H1-4 H1-3 H1-2 H1-1 Conjec-1 H14 H13 HAvoid3
HAvoid2 HAvoid H12 HindSightRule NonCriterialSlot H2 ThenDeleteOldConcepts
TheFirstOf TheSecondOf OR AND Abbrev Add Alg Anything ApplicGenerator Applics
Arity BestChoose BestSubset Bit CompiledDefn Conjecture Creditors CriterialSlot
DataType Defn DirectApplics DivisorsOf Domain DontCopy DoubleCheck EQ EQUAL
ElimSlots English EvenNum Examples FastAlg FastDefn Format Generalizations
Generator GoodChoose GoodSubset H1 H10 H11 H3 H4 H5 H6 H7 H8 H9 Heuristic IEQP
IGEQ IGREATERP ILEQ ILESSP IfAboutToWorkOnTask IfFinishedWorkingOnTask IfParts
IfPotentiallyRelevant IfTaskParts IfTrulyRelevant IfWorkingOnTask InDomainOf
IndirectApplics Inverse IsA IsRangeOf IterativeAlg IterativeDefn MathConcept
MathObj MathOp MathPred Multiply NNumber NonExamples NumOp OddNum Op PerfNum
PerfSquare Pred PrimeNum ProtoConjec RandomChoose RandomSubset Range
RecursiveAlg RecursiveDefn ReprConcept Set SetOfNumbers SetOp SibSlots Slot
Specializations Square SubSlots Successor SuperSlots Task ThenAddToAgenda
ThenCompute ThenConjecture ThenDefineNewConcepts ThenModifySlots ThenParts
ThenPrintToUser ToDelete ToDelete1 Transpose Unit UnitOp UnitizedAlg
UnitizedDefn Worth los1 los2 los3 los4 los5 los6 los7 win1)
:(MEMB 'H1 Units)
(H1 H10 H11 H3 H4 H5 H6 H7 H8 H9 Heuristic IEQP IGEQ IGREATERP ILEQ ILESSP
IfAboutToWorkOnTask IfFinishedWorkingOnTask IfParts IfPotentiallyRelevant
IfTaskParts IfTrulyRelevant IfWorkingOnTask InDomainOf IndirectApplics Inverse
IsA IsRangeOf IterativeAlg IterativeDefn MathConcept MathObj MathOp MathPred
Multiply NNumber NonExamples NumOp OddNum Op PerfNum PerfSquare Pred PrimeNum
ProtoConjec RandomChoose RandomSubset Range RecursiveAlg RecursiveDefn
ReprConcept Set SetOfNumbers SetOp SibSlots Slot Specializations Square SubSlots
Successor SuperSlots Task ThenAddToAgenda ThenCompute ThenConjecture
ThenDefineNewConcepts ThenModifySlots ThenParts ThenPrintToUser ToDelete
ToDelete1 Transpose Unit UnitOp UnitizedAlg UnitizedDefn Worth los1 los2 los3
los4 los5 los6 los7 win1)
:
NewNam(H1)
H1-19
:
(SUBSET Units 'ThenDefineNewConcepts)
(H14 H13 H12 H6)
:
EU(H12)
edit
*
F ThenD≠
=ThenDefineNewConcepts
*nx pp
[LAMBDA (task)
(SETQ NewUnit (CreateUnit (QUOTE HAvoid)
(QUOTE HAvoid)))
(SETPROPLIST NewUnit (SUBPAIR (QUOTE (GSlot CSlot CSlotSibs NotForReal))
(LIST GSlot CSlot CSlotSibs T)
(GETPROPLIST NewUnit)))
(SETQ NewUnits (CDR (ASSOC (QUOTE NewUnits)
TaskResults)))
[COND
(NewUnits (NCONC1 NewUnits NewUnit))
(T (SETQ TaskResults (CONS (LIST (QUOTE NewUnits)
NewUnit)
TaskResults]
[ADDPROP (QUOTE H12)
(QUOTE Applics)
(LIST (LIST (QUOTE TaskNum:)
TaskNum task (DATE))
(LIST NewUnit)
(InitializeCreditAssignment)
(LIST (QUOTE WillAvoid)
CSlot
(QUOTE slot)
(COND
((CDR CSlotSibs)
(LIST (QUOTE ,)
(QUOTE actually)
(QUOTE all)
(QUOTE of)
(QUOTE these:)
CSlotSibs
(QUOTE ,)))
(T (QUOTE ,)))
(QUOTE of)
(QUOTE units)
(QUOTE whenever)
(QUOTE finding)
GSlot
(QUOTE of)
(QUOTE them]
[MAPC (SETQ Creditors (CDR (ASSOC (QUOTE CreditTo)
CurSup)))
(FUNCTION (LAMBDA (H)
(ADDPROP H (QUOTE Applics)
(LIST (LIST (QUOTE TaskNum:)
TaskNum task (DATE))
(LIST NewUnit)
(DecrementCreditAssignment]
(PUT NewUnit (QUOTE Creditors)
(SETQ Creditors (CONS (QUOTE H12)
Creditors)))
T]
*OK
(FinishedEditing H12)
:LOADFROM(H1 EUR)
FILE NOT FOUND
H1
collecting atom name characters
189, 701 free cells, 22 pages left
(INFILE broken)
:
(INFILE broken)
:↑
(PRIN1 broken)
:UNDO LOADFROM
LOADFROM undone.
:WHEREIS(H1)
NIL
:
LOADVARS(H1)
NIL 's file not found
(PRIN1 broken)
:
LOADVARS((H1) EUR)
(new IfPotentiallyRelevant property for H1)
(new IfTrulyRelevant property for H1)
(new Worth property for H1)
(new Applics property for H1)
(new ThenPrintToUser property for H1)
(new ThenConjecture property for H1)
(new ThenAddToAgenda property for H1)
((PUTPROPS H1 IsA (Heuristic Op) English (IF the results of performing f are
only occasionally useful , THEN consider creating new specializations of f)
IfPotentiallyRelevant (LAMBDA (f) (* check that f has some recorded applications
-- which implies, of course, that f is an executable/performable entity) (
Applics f)) IfTrulyRelevant (LAMBDA (f) (* check that some Applics of f have
high Worth, but most have low Worth) (* the extent to which those conditions are
met will determine the amount of energy to expend working on applying this rule
-- its overall relevancy) (AND (SOME (Applics f) (QUOTE (LAMBDA (a) (* this
will have the format (args results)) (SOME (CADR a) (QUOTE HasHighWorth))))) (
GREATERP .2 (SETQ Fraction (FractionOf (MapUnion (Applics f) (QUOTE CADR)) (
QUOTE HasHighWorth)))))) Worth 709 Applics (((sit1) (win1 los1)) ((sit2) (los2
los3 los4 los5 los6))) Abbrev (Specialize a sometimes-useful action)
ThenPrintToUser (LAMBDA (f) (CPRIN1 13 "
" conjec ":" "
Since some specializations of " f " " (CONS "i.e., " (Abbrev f))
" are quite valuable, but over four-fifths are trash, EURISKO has recognized the value of finding new concepts similar to -- but more specialized than -- "
f
", and (to that end) has added a new task to the agenda to find such specializations. "
) T) ThenConjecture (LAMBDA (f) (SETQ Conjectures (CONS (PROGN (SETQ conjec (
NewNam (QUOTE Conjec))) (CreateUnit conjec (QUOTE ProtoConjec)) (PUT conjec (
QUOTE English) (NCONC (LIST (QUOTE Specializations) (QUOTE of) f) (APPEND (QUOTE
(may be more useful than it is, since it has some good instances but many more
poor ones))) (LIST (LIST (Percentify (DIFFERENCE 1.0 Fraction)) (QUOTE are) (
QUOTE losers))))) (PUT conjec (QUOTE Abbrev) (CONS f (QUOTE (sometimes wins,
usually loses, so specializations of it may win big)))) (PUT conjec (QUOTE Worth
) (FIX (Average (NearnessTo Fraction .1) (AverageWorths (QUOTE H1) f)))) conjec)
Conjectures))) ThenAddToAgenda (LAMBDA (f) (SETQ Agenda (MergeTasks (LIST (LIST
(AverageWorths f (QUOTE H1)) f (QUOTE Specializations) (LIST conjec) (LIST (
LIST (QUOTE CreditTo) (QUOTE H1))))) Agenda)) (AddPropL TaskResults (QUOTE
NewTasks) (QUOTE (1 unit must be specialized))))))
:
EU(H1)
edit
*
P
(IsA (Heuristic Op) English (IF the results of performing f are only
occasionally useful , THEN consider creating new specializations of f)
IfPotentiallyRelevant (LAMBDA & & &) IfTrulyRelevant (LAMBDA & & & &) Worth 709
Applics (& &) Abbrev (Specialize a sometimes-useful action) ThenPrintToUser (
LAMBDA & & T) ThenConjecture (LAMBDA & &) ThenAddToAgenda (LAMBDA & & &) --)
*21 UP P
... Specializations (H1-1 H1-2 H1-3 H1-4 H1-5 H1-6 H1-7 H1-8 H1-9 H1-10 H1-11
H1-12 H1-13 H1 H1 H1 H1 H1) Creditors (H6 H5-1 H1) Generalizations (H1 H1 H1 H1
H1))
*F Cred≠
=Creditors
*:
*:
*:
*:
*P
... (H1-1 H1-2 H1-3 H1-4 H1-5 H1-6 H1-7 H1-8 H1-9 H1-10 H1-11 H1-12 H1-13 H1 H1
H1 H1 H1))
*1 P
(H1-1 H1-2 H1-3 H1-4 H1-5 H1-6 H1-7 H1-8 H1-9 H1-10 H1-11 H1-12 H1-13 H1 H1 H1
H1 H1)
*-5 UP P
... H1 H1 H1 H1 H1)
*LI 1
*:
*OK
(FinishedEditing H1)
:↑
←SET(Agenda)
(Agenda reset)
NIL
←
(SUBSET Units 'Creditors)
(H1-18 H1-17 H1-16 H1-15 H4-5 H4-4 H4-3 H4-2 H3-6 H3-5 H3-4 H3-3 H3-2 EQ-4 EQ-3
EQ-2 H5-4 H5-3 H5-2 H1-13 H1-12 H1-11 H1-10 H1-9 Worth-2 Worth-1 Abbrev-1
English-1 H1-8 H1-7 H1-6 H1-5 H1-4 H1-3 H1-2 H1-1 EQ H3 H4 H5)
←
LOADVARS((EQ H3 H4 H5) EUR)
(new Worth property for EQ)
(new IsA property for EQ)
(new Arity property for EQ)
(new Generalizations property for EQ)
(new ElimSlots property for EQ)
(new English property for H3)
(new Worth property for H3)
(new Applics property for H3)
(new Abbrev property for H3)
(new IfWorkingOnTask property for H3)
(new ThenPrintToUser property for H3)
(new ThenCompute property for H3)
(new IsA property for H4)
(new English property for H4)
(new Worth property for H4)
(new Abbrev property for H4)
(new ThenPrintToUser property for H4)
(new Worth property for H5)
(new Applics property for H5)
(new Abbrev property for H5)
(new IfWorkingOnTask property for H5)
(new ThenPrintToUser property for H5)
collecting lists
21633, 21633 free cells, 22 pages left
((PUTPROPS EQ Worth 500 IsA (MathConcept MathOp Op MathPred Pred) FastAlg (
LAMBDA (X Y) (EQ X Y)) Arity 2 Domain (Anything Anything) Range (Bit)
Generalizations (EQUAL) ElimSlots (Applics)) (PUTPROPS H3 IsA (Heuristic Op)
English (IF the current task is to specialize a unit, and no specific slot has
been chosen to be the one changed, THEN randomly select a slot to specialize)
IfPotentiallyRelevant NULL Worth 704 Applics (((sit1) (win1 los1))) Abbrev (
Specialize u by specializing one random slot) IfWorkingOnTask (LAMBDA (task) (
AND (IsAKindOf CurSlot (QUOTE Specializations)) (NULL (ASSOC (QUOTE SlotToChange
) CurSup)) (IGEQ 11 (TheNumberOf Agenda (FUNCTION (LAMBDA (Z) (AND (EQ CurUnit (
ExtractUnitName Z)) (EQ CurSlot (ExtractSlotName Z))))))))) ThenPrintToUser (
LAMBDA (task) (CPRIN1 13 CRLF NewReason CRLF CRLF) T) ThenAddToAgenda (LAMBDA (
task) (SETQ Agenda (MergeTasks (LIST (LIST (Average CurPri (AverageWorths
CurUnit (QUOTE H3))) CurUnit CurSlot (CONS (SETQ NewReason (LIST
"A new unit will be created by specializing the " SlotToChange " slot of "
CurUnit "; that slot was chosen randomly.")) NIL) (LIST (LIST (QUOTE
SlotToChange) SlotToChange) (CONS (QUOTE CreditTo) (CONS (QUOTE H3) CreditTo))))
) Agenda)) (SETQ TaskResults (AddPropL TaskResults (QUOTE NewTasks) (LIST 1 (
QUOTE specific) (QUOTE slot) (QUOTE of) CurUnit (QUOTE to) (QUOTE find) CurSlot
(QUOTE of))))) ThenCompute (LAMBDA (task) (SETQ SlotToChange (RandomChoose (
SetIntersect (SlotNames CurUnit) (Examples (QUOTE Slot))))) (SETQ CreditTo (CDR
(ASSOC (QUOTE CreditTo) CurSup))) T)) (PUTPROPS H4 IsA (Heuristic Op) English (
IF a new unit has just been synthesized, THEN its a good idea to find instances
of it) IfPotentiallyRelevant NULL Worth 701 Applics (((sit1) (win1 los1)))
Abbrev (Plan to gather empirical data about new concepts)
IfFinishedWorkingOnTask (LAMBDA (task) (SETQ NewUnits (CDR (ASSOC (QUOTE
NewUnits) TaskResults)))) ThenPrintToUser (LAMBDA (task) (CPRIN1 13 CRLF (LENGTH
NewUnits) " new units ") (CPRIN1 33 ", namely " NewUnits ", ") (CPRIN1 13
"were defined. New tasks are being added to the agenda to ensure that empirical data about them will soon be gathered. "
CRLF CRLF) T) ThenAddToAgenda (LAMBDA (task) (SETQ Agenda (MergeTasks (MAPCAR
NewUnits (FUNCTION (LAMBDA (NewUnit) (LIST (AverageWorths NewUnit (QUOTE H4))
NewUnit (Instances NewUnit) (LIST
"After a unit is synthesized, it is useful to seek instances of it.") (LIST (
QUOTE CreditTo) (QUOTE H4)))))) Agenda)) (SETQ TaskResults (AddPropL TaskResults
(QUOTE NewTasks) (CONS (LENGTH NewUnits) (QUOTE (new units must have instances
found))))))) (PUTPROPS H5 IsA (Heuristic Op) English (IF the current task is to
specialize a unit, and no specific slot has been chosen to be the one changed,
THEN randomly select which slots to specialize) IfPotentiallyRelevant NULL Worth
708 Applics (((sit1) (win1 los1))) Abbrev (Specialize u by specializing some
random slots) IfWorkingOnTask (LAMBDA (task) (AND (IsAKindOf CurSlot (QUOTE
Specializations)) (NULL (ASSOC (QUOTE SlotToChange) CurSup)) (IGEQ 7 (
TheNumberOf Agenda (FUNCTION (LAMBDA (Z) (AND (EQ CurUnit (ExtractUnitName Z)) (
EQ CurSlot (ExtractSlotName Z))))))))) ThenPrintToUser (LAMBDA (task) (CPRIN1 13
CRLF CurUnit " will be specialized by specializing the following of its slots: "
SlotsToChange CRLF CRLF) T) ThenAddToAgenda (LAMBDA (task) (SETQ Agenda (
MergeTasks (SORT (MAPCAR SlotsToChange (FUNCTION (LAMBDA (S) (LIST (Average
CurPri (AverageWorths S (QUOTE H5))) CurUnit CurSlot (CONS (SETQ NewReason (LIST
"A new unit will be created by specializing the " S " slot of " CurUnit
"; that slot was chosen randomly.")) NIL) (LIST (LIST (QUOTE SlotToChange) S) (
CONS (QUOTE CreditTo) (CONS (QUOTE H5) CreditTo))))))) (QUOTE OrderTasks))
Agenda)) (SETQ TaskResults (AddPropL TaskResults (QUOTE NewTasks) (LIST (LENGTH
SlotsToChange) (QUOTE specific) (QUOTE slots) (QUOTE of) CurUnit (QUOTE to) (
QUOTE find) CurSlot (QUOTE of))))) ThenCompute (LAMBDA (task) (SETQ
SlotsToChange (RandomSubset (SetIntersect (SlotNames CurUnit) (Examples (QUOTE
Slot))))) (SETQ CreditTo (CDR (ASSOC (QUOTE CreditTo) CurSup))) T)))
←
MAPCAR((EQ H3 H4 H5) Creditors)
((H6 H5-1 H6) (H6 H5-2 H1-3) (H6 H5-2 H1-3) (H6 H5 H1))
←
(MAPCAR('(EQ H3 H4 H5) '(LAMBDA (Z) (REMPROP Z 'Creditors]
u.d.f.
(QUOTE (EQ H3 H4 H5))
←
(MAPCAR '(EQ H3 H4 H5) '(LAMBDA (Z) (REMPROP Z 'Creditors]
(Creditors Creditors Creditors Creditors)
←
SYSOUT(EMERG)
<CSD.LENAT>EMERG.EXE.2
←
EU(EQ)
edit
*
PP
(CTYPE PRED CLISPTYPE -20 CLISPINFIX = BROADSCOPE T CLISPISPROP (eq)
CLISPISFORM
((X Y)
(X IS EQ TO Y)
(X = Y))
Worth 500 IsA (MathConcept MathOp Op MathPred Pred)
FastAlg
[LAMBDA (X Y)
(EQ X Y]
Arity 2 Domain (Anything Anything)
Range
(Bit)
Generalizations
(EQUAL)
ElimSlots
(Applics)
Specializations
(EQ EQ EQ EQ))
*-2 P
Specializations
*:
:
*OK
(FinishedEditing EQ)
←NewU
(H1-18 H1-17 H1-16 H1-15 H1-14 Conjec-31 Conjec-30 Conjec-29 Conjec-28 Conjec-27
Conjec-26 Conjec-25 Conjec-24 Conjec-23 Conjec-22 Conjec-21 Conjec-20 Conjec-19
Conjec-18 H4-5 H4-4 H4-3 H4-2 H4-1 Conjec-17 H3-6 H3-5 H3-4 H3-3 H3-2 H3-1
Conjec-16 EQ-4 EQ-3 EQ-2 EQ-1 H5-4 H5-3 H5-2 H5-1 Conjec-15 Conjec-14 Conjec-13
Conjec-12 Conjec-11 Conjec-10 Conjec-9 Conjec-8 Conjec-7 Conjec-6 Conjec-5
Conjec-4 Conjec-3 Conjec-2 H1-13 H1-12 H1-11 H1-10 H1-9 Worth-2 Worth-1 Abbrev-1
English-1 H1-8 H1-7 H1-6 H1-5 H1-4 H1-3 H1-2 H1-1 Conjec-1)
←NewUnit
H1
←SET(NewUnit)
(NewUnit reset)
NIL
←
EU(EQ-1)
edit
*
PP
(Worth 500 IsA (MathConcept MathOp Op MathPred Pred)
FastAlg
[LAMBDA (X Y)
(EQ-1 X Y]
Arity 2 Domain (Anything Anything)
Range
(Bit)
Generalizations
(EQUAL)
ElimSlots
(Applics)
Applics
(((NIL NIL)
NIL)))
*OK
(FinishedEditing EQ-1)
←EDITF(CreateUnit)
edit
*
P
(LAMBDA (N NOLD) **COMMENT** (COND & & & &) (DefineIfSlot N))
*LI 4
4
*(-1 PROG1)
*
E GETD(PROG1)
(49 . #12447)
*
P
(PROG1 (COND & & & &) (DefineIfSlot N))
*OK
CreateUnit
←EDITF(NU)
edit
*
P
(LAMBDA (N NOLD) **COMMENT** (COND & & & &) (DefineIfSlot N))
*LI 4
*4 (-1 PROG1)
*
P
(PROG1 (COND & & & &) (DefineIfSlot N))
*OK
NU
←FILES?)
EUR...to be dumped.
plus the variables: NewUnit
plus the functions: PRINTDEF
want to say where the above go ? No
NIL
←
DRIBBLEFILE)
<CSD.LENAT>TRACE.MAR24.4
←
SOS)
Closing <CSD.LENAT>TRACE.MAR24.4
collecting string characters
96, 608 free cells, 21 pages left